A method for updating that justifies minimum cross entropy

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Minimum Cross Entropy Method For Rare Event Simulations

This paper describes a new idea of finding the importance sampling density in rare events simulations: the MinxEnt method (shorthand for minimum cross-entropy). Some preliminary results show that the method might be very promising. 1 The minxent program Assume • X = (X1, . . . ,Xn) is a random vector (with values denoted by x); • h is the joint density function of X; • Sj(·) (j = 1, . . . , k) ...

متن کامل

Minimum Cross-entropy Reasoning: a Statistical Justiication

Degrees of belief are formed using observed evidence and statistical background information. In this paper we examine the process of how prior degrees of belief derived from the evidence are combined with statistical data to form more speciic degrees of belief. A statistical model for this process then is shown to vindicate the cross-entropy minimization principle as a rule for probabilistic de...

متن کامل

Minimum Cross-Entropy Reasoning: A Statistical Justification

Degrees of belief are formed using observed ev­ idence and stat ist ical background in format ion. In this paper we examine the process of how pr ior degrees of belief derived f rom the evidence are combined w i th stat ist ical data to form more specific degrees of belief. A stat ist ical model for this process then is shown to vindicate the cross-entropy min imizat ion principle as a rule for...

متن کامل

A cross entropy algorithm for continuous covering location problem

Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...

متن کامل

A Stochastic Minimum Cross-Entropy Method for Combinatorial Optimization and Rare-event Estimation

We present a new method, called the minimum cross-entropy (MCE) method for approximating the optimal solution of NP-hard combinatorial optimization problems and rare-event probability estimation, which can be viewed as an alternative to the standard cross entropy (CE) method. The MCE method presents a generic adaptive stochastic version of Kullback’s classic MinxEnt method. We discuss its simil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 1992

ISSN: 0888-613X

DOI: 10.1016/0888-613x(92)90022-r